Lattice-Based Relation Algebras and Their Representability
نویسندگان
چکیده
منابع مشابه
Undecidable Problems on Representability as Binary Relations
We establish the undecidability of representability and of finite representability as algebras of binary relations in a wide range of signatures. In particular, representability and finite representability are undecidable for Boolean monoids and lattice ordered monoids, while representability is undecidable for Jónsson’s relation algebra. We also establish a number of undecidability results for...
متن کاملLattice of full soft Lie algebra
In this paper, we study the relation between the soft sets and soft Lie algebras with the lattice theory. We introduce the concepts of the lattice of soft sets, full soft sets and soft Lie algebras and next, we verify some properties of them. We prove that the lattice of the soft sets on a fixed parameter set is isomorphic to the power set of a ...
متن کاملGames in algebraic logic: axiomatisations and beyond
Outline 1. Algebras of relations: a quick introduction to relation algebras, representable relation algebras 2. Case study: atomic and finite relation algebras • atom structures; representations of finite relation algebras • two examples: McKenzie’s algebra; the so-called ‘anti-Monk algebra’ 3. Games to characterise representability: the games, axioms from games, examples 4. Infinite relation a...
متن کاملComplementation in Representable Theories of Region-Based Space
Through contact algebras we study theories of mereotopology in a uniform way that clearly separates mereological from topological concepts. We identify and axiomatize an important subclass of closure mereotopologies (CMT) called unique closure mereotopologies (UCMT) whose models always have orthocomplemented contact algebras (OCA) an algebraic counterpart. The notion of MT-representability, a w...
متن کاملRelevant logic and relation algebras
In 2007, Maddux observed (see [7]) that relevant logics have a natural interpretation in the language of relation algebras, with respect to which certain standard relevant logics are sound. He asked whether this interpretation was complete as well. In 2008, Mikulás proved in [10] that the relevant logic R was not complete with respect to square-increasing, commutative, representable relation al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003